The proposed algorithms use path-based multicast routing models, other than by finding Hamiltonian or Eulerian path in the network. 所提出的算法用基于路径的组播路由模型,而不是在网络中找出哈密尔顿路径或欧拉路径。
The Eulerian path approach reduces the sequence assembly to a variation of the classical Eulerian path problem that solves the "repeat" problem existing in the traditional sequence assembly program. 〔2〕中将Eulerian路径的方法应用于序列拼接,较好地解决传统序列拼装软件中存在的repeat问题,从而提高序列拼装的精度。
Specification and Parallelization of Eulerian-path Algorithm of Sequence Assembly Using Gamma Model 生物序列拼装欧拉路径算法的Gamma描述及其并行化研究